The hyperdeterminant and triangulations of the 4-cube
نویسندگان
چکیده
The hyperdeterminant of format 2 × 2 × 2 × 2 is a polynomial of degree 24 in 16 unknowns which has 2894276 terms. We compute the Newton polytope of this polynomial and the secondary polytope of the 4-cube. The 87959448 regular triangulations of the 4-cube are classified into 25448 Dequivalence classes, one for each vertex of the Newton polytope. The 4-cube has 80876 coarsest regular subdivisions, one for each facet of the secondary polytope, but only 268 of them come from the hyperdeterminant.
منابع مشابه
Acute Triangulations of Polyhedra and R
We study the problem of acute triangulations of convex polyhedra and the space R. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n-cube do not exist for n≥4. Further, we prove that acute triangulations of the space R do not exist for n≥5. In the opposite direction, in R, we present a construction of an acu...
متن کاملLower Bounds for Simplicial Covers and Triangulations of Cubes
We show that the size of a minimal simplicial cover of a polytope P is a lower bound for the size of a minimal triangulation of P , including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and we improve lower bounds for covers and triangulations in dimensions 4 through at least 12 (and possibly more dimensions as well). Important ingredients are an an...
متن کاملAcute triangulations of polyhedra and ℝ N
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n–cube do not exist for n ≥ 4. Further, we prove that acute triangulations of the space Rn do not exist for n ≥ 5. In the opposite direction, in R3, we present a construction of...
متن کاملAsymptotically efficient triangulations of the d-cube
Triangulating the regular d-cube I = [0, 1] in a “simple” way has many applications, like solving differential equations by finite element methods or calculating fixed points. See, for example, [7]. Determining the smallest number of simplices needed has brought special attention both from a theoretical point of view and from an applied one (see [6, Section 14.5.2] for a recent survey). Before ...
متن کاملJa n 20 06 BALANCED TRIANGULATIONS OF LATTICE POLYTOPES
Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. Such triangulations are instrumental in deriving lower bounds for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile (Adv. Math., to appear). Special attention is paid to the cube case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 77 شماره
صفحات -
تاریخ انتشار 2008